Complexity Reduction of MIMO Decoder
نویسندگان
چکیده
-The data rates and the supported range in communication systems, can be increased using MIMO (Multiple input and multiple output) technique. MIMO technique uses multiple antennas at both transmitter and receiver. MIMO systems uses Orthogonal frequency division multiplexing (OFDM) technique for multicarrier modulation. QR decomposition (QRD) is the first step in the decoding of the MIMO receiver. Gram Schmidt, Householder and Givens described QR decomposition method which are computationally intensive as these involve division operation for normalization. The computation complexity of these methods for MIMO-OFDM systems is difficult to handle because QR decomposition is performed for each subcarrier. Sphere decoder is an efficient decoder for MIMO systems. In this paper we use Modified Householder’s method for reducing the computation complexity without affecting the system packet error rate (PER) performance. The simulation process is carried out in all different models of 802.11 TGAC channels.
منابع مشابه
Efficient decoding algorithm using triangularity of $\mbf{R}$ matrix of QR-decomposition
An efficient decoding algorithm named ‘divided decoder’ is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides various combinations of two or more different searching algorithms. Hence it makes flexibility in error rate and complexity for the algorithms using it. We c...
متن کاملFixed Point Realization of Iterative LR-Aided Soft MIMO Decoding Algorithm
Multiple-input multiple-output (MIMO) systems have been widely acclaimed in order to provide high data rates. Recently Lattice Reduction (LR) aided detectors have been proposed to achieve near Maximum Likelihood (ML) performance with low complexity. In this paper, we develop the fixed point design of an iterative soft decision based LR-aided K-best decoder, which reduces the complexity of exist...
متن کاملComplexity Reduction in Iterative MIMO Receivers Based on EXIT Chart Analysis
The application of the Turbo principle in MIMO receivers allows to achieve near-capacity performance with a number of different MIMO detection algorithms. However, this high performance is paid for by a substantial increase in complexity, as detector and decoder have to be run multiple times. In this paper, we show that an analysis of detector and decoder transfer curves in the EXIT chart can b...
متن کاملLow-complexity dominance-based Sphere Decoder for MIMO Systems
The sphere decoder (SD) is an attractive low-complexity alternative to maximum likelihood (ML) detection in a variety of communication systems. It is also employed in multiple-input multiple-output (MIMO) systems where the computational complexity of the optimum detector grows exponentially with the number of transmit antennas. We propose an enhanced version of the SD based on an additional cos...
متن کاملTwo Methods for Decreasing the Computational Complexity of the MIMO ML Decoder
We propose use of QR factorization with sort and Dijkstra’s algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signals on the multi-antenna fading channel. QR factorization with sort decreases the complexity of searching part of the decoder with small increase in the complexity required for preprocessing part of the decoder. Dijkstra’s a...
متن کامل